Least Squares Approximation of Flatness on Riemannian Manifolds
نویسندگان
چکیده
منابع مشابه
Least-Squares Log-Density Gradient Clustering for Riemannian Manifolds
Mean shift is a mode-seeking clustering algorithm that has been successfully used in a wide range of applications such as image segmentation and object tracking. To further improve the clustering performance, mean shift has been extended to various directions, including generalization to handle data on Riemannian manifolds and extension to directly estimating the log-density gradient without de...
متن کاملApproximation of Functions over Manifolds: A Moving Least-Squares Approach
We present an algorithm for approximating a function defined over a d-dimensional manifold utilizing only noisy function values at locations sampled from the manifold with noise. To produce the approximation we do not require any knowledge regarding the manifold other than its dimension d. The approximation scheme is based upon the Manifold Moving Least-Squares (MMLS) presented in [25]. The pro...
متن کاملManifolds' Projective Approximation Using The Moving Least-Squares (MMLS)
In order to avoid the curse of dimensionality, frequently encountered in Big Data analysis, there was a vast development in the field of linear and non-linear dimension reduction techniques in recent years. These techniques (sometimes referred to as manifold learning) assume that the scattered input data is lying on a lower dimensional manifold, thus the high dimensionality problem can be overc...
متن کاملPartial Least Squares Regression on Riemannian Manifolds and Its Application in Classifications
Partial least squares regression (PLSR) has been a popular technique to explore the linear relationship between two datasets. However, most of algorithm implementations of PLSR may only achieve a suboptimal solution through an optimization on the Euclidean space. In this paper, we propose several novel PLSR models on Riemannian manifolds and develop optimization algorithms based on Riemannian g...
متن کاملLeast Squares Approximation
In many applications we want to find an approximation for a function, for example for differential equations. Example problem: We want to understand how a calculator or computer can evaluate sinx for a given value x. The processor can essentially only perform addition, multiplication, division. Therefore we can try to approximate the function with a polynomial. We use the notation Pn for polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8101757